Online-Offline Homomorphic Signatures for Polynomial Functions
نویسندگان
چکیده
The advent of cloud computing has given rise to a plethora of work on verifiable delegation of computation. Homomorphic signatures are a powerful tool that can be tailored for verifiable computation, as long as they are efficiently verifiable. The main advantages of homomorphic signatures are twofold: (i) public verifiability: Any third party can verify the correctness of the delegated computation; (ii) statelessness: The verifier is not required to have access to the dataset on which the computation was performed. Thus in this paper, we design a homomorphic signature suitable for multivariate polynomials of bounded degree, and which draws upon the algebraic properties of eigenvectors and leveled multilinear maps. The proposed signature yields an efficient verification process (in an amortized sense) and supports offline-online signing. Furthermore, our signature is provably secure and its size grows only linearly with the degree of the evaluated polynomial.
منابع مشابه
Homomorphic Signatures for Polynomial Functions with Shorter Signatures
We present homomorphic signatures for polynomial functions with shorter signatures than the ones of Boneh and Freeman. In the signing algorithm, instead of using the preimage sampling algorithm of Gentry, Peikert, and Vaikuntanathan, we use the algorithm of Micciancio and Peikert, which is more efficient (the algorithm can sample smaller preimages) than the one of Gentry et al. Consequently, th...
متن کاملHomomorphic Signature Schemes - A Survey
Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-dated survey about the state of the art of homomorphic signature schemes. First, the general framework where homomorphic signatures are defined is described and it is shown how ...
متن کاملGeneric Construction of Chameleon Hash to Group Elements
—Chameleon hash functions are trapdoor one-way functions with many applications such as chameleon signatures and on-line/off-line signatures. Previous research focused on the concrete constructions based on different assumptions, as well as schemes without the key-exposure problem. In this paper, we consider the structure-preserving schemes where messages, hash value and public keys all consis...
متن کاملBounded Fully Homomorphic Signature Schemes
Homomorphic signatures enable anyone to publicly perform computations on signed data and produce a compact tag to authenticate the results. In this paper, we construct two bounded fully homomorphic signature schemes, as follows. – For any two polynomials d = d(λ), s = s(λ), where λ is the security parameter. Our first scheme is able to evaluate any circuit on the signatures, as long as the dept...
متن کاملHomomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an efficient algorithm to produce a signature on the mean, standard deviation, and other statistics of the signed data. Previous systems for computing on signed data could only handle linear operations. For polynomials of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015